Hierarchical matrix arithmetic with accumulated updates
نویسندگان
چکیده
منابع مشابه
Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational biology, and clustering. In this letter, we consider two well-known algorithms designed to solve NMF problems: the multiplicative updates of Lee and Seung and the hierarchical alternating least squares of Ci...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولScalable Nonnegative Matrix Factorization with Block-wise Updates
Nonnegative Matrix Factorization (NMF) has been applied with great success to many applications. As NMF is applied to massive datasets such as web-scale dyadic data, it is desirable to leverage a cluster of machines to speed up the factorization. However, it is challenging to efficiently implement NMF in a distributed environment. In this paper, we show that by leveraging a new form of update f...
متن کاملMental Arithmetic Task Recognition Using Effective Connectivity and Hierarchical Feature Selection From EEG Signals
Introduction: Mental arithmetic analysis based on Electroencephalogram (EEG) signal for monitoring the state of the user’s brain functioning can be helpful for understanding some psychological disorders such as attention deficit hyperactivity disorder, autism spectrum disorder, or dyscalculia where the difficulty in learning or understanding the arithmetic exists. Most mental arithmetic recogni...
متن کاملFactorized solution of the Lyapunov equation by using the hierarchical matrix arithmetic ∗
We investigate the solution of the Lyapunov equation with the matrix sign function method. In order to obtain the factorized solution we use a partitioned Newton iteration, where one part of the iteration uses formatted arithmetic for the hierarchical matrix format while the other part converges to an approximate full-rank factor of the solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing and Visualization in Science
سال: 2019
ISSN: 1432-9360,1433-0369
DOI: 10.1007/s00791-019-00311-3